The independence number
and the dissociation number
of a graph
are the largest orders of induced subgraphs of
of maximum degree at most 0 and at most 1, respectively. We consider possible improvements of the obvious inequality
. For connected cubic graphs
distinct from
, we show
...